翻訳と辞書 Words near each other ・ Beulah Park ・ Beulah Park racetrack ・ Between Valleys ・ Between Wars ・ Between Waves ・ Between Yesterday and Tomorrow ・ Between Yesterday and Tomorrow (film) ・ Between you and I ・ Between You and Me ・ Between You and Me (disambiguation) ・ Between Your Legs ・ Between, Georgia ・ Between-group design ・ Between-Systems Memory Interference Model ・ Betweenness ・ Betweenness centrality ・ Betwixt ・ Betwixt & Between ・ Betwixt and Between ・ Betwixt! ・ Betws Bach ・ Betws Bledrws ・ Betws Garmon ・ Betws Gwerfil Goch ・ Betws Ifan ・ Betws RFC ・ Betws yn Rhos ・ Betws, Carmarthenshire ・ Betws, Carmarthenshire (electoral ward) ・ Betws-y-Coed Dictionary Lists mini英和辞書 mini和英辞書 Webster 1913 Latin-English FOLDOC Wikipedia English ウィキペディア

翻訳と辞書　辞書検索 [ 開発暫定版 ] スポンサード リンク Betweenness centrality ： ウィキペディア英語版 Betweenness centrality Betweenness centrality is an indicator of a node's centrality in a network. It is equal to the number of shortest paths from all vertices to all others that pass through that node. A node with high betweenness centrality has a large influence on the transfer of items through the network, under the assumption that item transfer follows the shortest paths. The concept finds wide application, including computer and social networks, biology, transport and scientific cooperation. Development of ''betweenness centrality'' is generally attributed to sociologist Linton Freeman. The idea was earlier proposed by mathematician J. Anthonisse, but his work was never published. == Definition == The betweenness centrality of a node $v$ is given by the expression: :$g(v)=\; \backslash sum\_\backslash frac$ is the total number of shortest paths from node $s$ to node $t$ and $\backslash sigma\_(v)$ is the number of those paths that pass through $v$. Note that the betweenness centrality of a node scales with the number of pairs of nodes as implied by the summation indices. Therefore the calculation may be rescaled by dividing through by the number of pairs of nodes not including $v$, so that $g\; \backslash in\; ()$. The division is done by $(N-1)(N-2)$ for directed graphs and $(N-1)(N-2)/2$ for undirected graphs, where $N$ is the number of nodes in the giant component. Note that this scales for the highest possible value, where one node is crossed by every single shortest path. This is often not the case, and a normalization can be performed without a loss of precision :$\backslash mbox(g(v))\; =\; \backslash frac$ which results in: :$\backslash max(normal)\; =\; 1$ :$\backslash min(normal)\; =\; 0$ Note that this will always be a scaling from a smaller range into a larger range, so no precision is lost. 抄文引用元・出典: フリー百科事典『 ウィキペディア（Wikipedia）』 ■ウィキペディアで「Betweenness centrality」の詳細全文を読む スポンサード リンク 翻訳と辞書 : 翻訳のためのインターネットリソース Copyright(C) kotoba.ne.jp 1997-2016. All Rights Reserved.